Boolean satisfiability problem

Results: 324



#Item
131Computational complexity theory / Abstract algebra / Linear algebra / NP-complete problems / Logic in computer science / Boolean satisfiability problem / Time complexity / PP / Element distinctness problem / Theoretical computer science / Mathematics / Algebra

Chicago Journal of Theoretical Computer Science The MIT Press Volume 1999, Article 8 Lower Bounds for Linear Satisfiability Problems ISSN 1073–0486. MIT Press Journals, Five Cambridge Center, Cambridge,

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 1999-10-13 17:17:56
132Complexity classes / Boolean algebra / Constraint programming / Mathematical optimization / Boolean satisfiability problem / Constraint satisfaction problem / NP-complete / Belief propagation / NP / Theoretical computer science / Computational complexity theory / Applied mathematics

Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting Lukas Kroc, Ashish Sabharwal, Bart Selman Cornell University May 23, 2008

Add to Reading List

Source URL: www.cs.cornell.edu

Language: English - Date: 2009-02-12 00:13:50
133Constraint programming / Electronic design automation / Formal methods / Logic in computer science / NP-complete problems / Boolean satisfiability problem / Symbol / Tree automaton / Satisfiability / Theoretical computer science / Applied mathematics / Mathematics

Efficient Reasoning about Data Trees via Integer Linear Programming Claire David Leonid Libkin

Add to Reading List

Source URL: homepages.inf.ed.ac.uk

Language: English - Date: 2010-12-15 16:00:04
134Conjunctive query / Database theory / Complexity classes / Relational model / Structure / Data integration / Symbol / FO / Boolean satisfiability problem / Theoretical computer science / Mathematics / Data management

Reasoning About Pattern-Based XML Queries Am´elie Gheerbrant1, Leonid Libkin1, and Cristina Sirangelo2 1 School of Informatics, University of Edinburgh 2

Add to Reading List

Source URL: homepages.inf.ed.ac.uk

Language: English - Date: 2013-06-07 12:18:52
135Mathematical logic / Constraint programming / Formal methods / Logic in computer science / Boolean algebra / Boolean satisfiability problem / Unit propagation / Resolution / Davis–Putnam algorithm / Theoretical computer science / Mathematics / Automated theorem proving

Enhancing Davis Putnam with Extended Binary Clause Reasoning Fahiem Bacchus Dept. Of Computer Science University Of Toronto Toronto, Ontario Canada, M5S 1A4

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2002-04-08 12:32:58
136Support vector machine / Machine learning / Constraint programming / Satisfiability / Active learning / Constraint satisfaction problem / PP / Boolean satisfiability problem / Theoretical computer science / Statistical classification / Applied mathematics

A Phase Transition-Based Perspective on Multiple Instance Kernels Romaric Gaudel1,2 , Mich`ele Sebag1 , and Antoine Cornu´ejols3 1 CNRS − INRIA − Univ. Paris-Sud, FOrsay, France

Add to Reading List

Source URL: www.lri.fr

Language: English - Date: 2007-11-19 08:56:00
137Logic in computer science / Model theory / Boolean algebra / Boolean satisfiability problem / Electronic design automation / Interpretation / Symbol / Function / Mathematics / Theoretical computer science / Mathematical logic

A Decision Procedure for a Sublanguage of Set Theory Involving Monotone, Additive, and Multiplicative Functions. I. The Two-Level Case. Calogero G. Zarba () LORIA and INRIA-Lorraine 615, rue du Jardin Botan

Add to Reading List

Source URL: www.multimedialibrary.com

Language: English - Date: 2014-03-05 12:40:27
138Applied mathematics / Formal methods / Logic in computer science / Constraint programming / Boolean algebra / Boolean satisfiability problem / Resolution / Unit propagation / Clause / Theoretical computer science / Automated theorem proving / Mathematics

Exploring the Computational Tradeoff of more Reasoning and Less Searching Fahiem Bacchus Dept. Of Computer Science University Of Toronto Toronto, Ontario

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2002-05-15 13:05:48
139Model theory / Philosophical logic / Automated theorem proving / Method of analytic tableaux / Abox / Structure / Boolean satisfiability problem / PSPACE-complete / Modal logic / Theoretical computer science / Mathematical logic / Mathematics

Journal of Automated Reasoning manuscript No. (will be inserted by the editor) PSpace Tableau Algorithms for Acyclic Modalized ALC Jia Tao · Giora Slutzki · Vasant Honavar

Add to Reading List

Source URL: www.cs.iastate.edu

Language: English - Date: 2011-06-14 00:05:06
140Applied mathematics / Resolution / True quantified Boolean formula / Propositional variable / Unit propagation / Satz / DPLL algorithm / Boolean satisfiability problem / Theoretical computer science / Automated theorem proving / Mathematics

Solving Non-clausal Formulas with DPLL search Christian Thiffault1 , Fahiem Bacchus1 , and Toby Walsh 2   1 Department of Computer Science, University of Toronto, Toronto, Ontario, Canada

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2004-07-03 23:15:04
UPDATE